Classes of linear automata
نویسندگان
چکیده
منابع مشابه
Linear functional classes over cellular automata
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper, we investigate the ability of cellular automata related to functional computation. We introduce several functional classes of low time complexity which conta...
متن کاملLearning Classes of Probabilistic Automata
Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of research. We show that PFA are identifiable in the limit with probability one. Multiplicity automata (MA) is another device to represent stochastic languages. We show that a MA may generate a stochastic language that cannot be genera...
متن کاملUniversality Classes of Chaotic Cellular Automata
Cellular automata (CA) are discrete, spatially-homogeneous, locally-interacting dynamical systems of very simple construction, but which exhibit a rich intrinsic behavior. Even starting from disordered initial configurations, CA can evolve into ordered states with complex structures crystallized in space-time patterns. In this paper we concentrate on deterministic one-dimensional CA defined by ...
متن کاملDecidable and Expressive Classes of Probabilistic Automata
Hierarchical probabilistic automata (HPA) are probabilistic automata whose states are partitioned into levels such that for any state and input symbol, at most one transition with non-zero probability goes to a state at the same level, and all others go to states at a higher level. We present expressiveness and decidability results for 1-level HPAs that work on both finite and infinite length i...
متن کاملClasses of Finite State Automata for Which Compositional Minimization is Linear Time
We describe a compositional algorithm for the minimization of nite state automata relative to branching bisimulation. With respect to this algorithm we describe an in nite class of automata for which the algorithm is linear time. The class includes the classical dining philospher problem and variants. The proof involves showing that certain families of automata generate nite submonoids of a bis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 1987
ISSN: 0143-3857,1469-4417
DOI: 10.1017/s0143385700003837